Search results for "Multiprocessor scheduling"

showing 2 items of 2 documents

Two Job Cyclic Scheduling with Incompatibility Constraints

2001

The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.

Rate-monotonic schedulingMathematical optimizationJob shop schedulingComputer scienceStrategy and ManagementDistributed computingFlow shop schedulingDynamic priority schedulingManagement Science and Operations ResearchFair-share schedulingMultiprocessor schedulingComputer Science ApplicationsNurse scheduling problemManagement of Technology and InnovationTwo-level schedulingBusiness and International ManagementComputer Science::Operating Systems
researchProduct

Scheduling shared continuous resources on many-cores

2014

We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement rj∈[0,1]. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their processing speeds, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature. In this paper, …

Mathematical optimizationJob shop schedulingComputer scienceDistributed computingApproximation algorithmJob assignmentUnit sizeCompletion timeResource assignmentMultiprocessor schedulingScheduling (computing)Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
researchProduct